Transverse group actions on bundles
نویسندگان
چکیده
منابع مشابه
Group Actions on Vector Bundles on the Projective Plane
We study the action of the group of automorphisms of the projective plane on the Maruyama scheme of sheaves MP 2(r, c1,c2) of rank r and Chern classes c1 = 0 and c2 = n and obtain sufficient conditions for unstability in the sense of Mumford’s geometric invariant theory. The conditions are in terms of the splitting behaviour of sheaves when restricted to lines in the projective plane. A very st...
متن کاملLifts of Smooth Group Actions to Line Bundles
Let X be a compact manifold with a smooth action of a compact connected Lie group G. Let L → X be a complex line bundle. Using the Cartan complex for equivariant cohomology, we give a new proof of a theorem of Hattori and Yoshida which says that the action of G lifts to L if and only if the first Chern class c1(L) of L can be lifted to an integral equivariant cohomology class in H G (X ;Z), and...
متن کاملGroup Actions on Partitions
We introduce group actions on the integer partitions and their variances. Using generating functions and Burnside’s lemma, we study arithmetic properties of the counting functions arising from group actions. In particular, we find a modulo 4 congruence involving the number of ordinary partitions and the number of partitions into distinct parts.
متن کاملGroup Actions on Posets
In this paper we study quotients of posets by group actions. In order to define the quotient correctly we enlarge the considered class of categories from posets to loopfree categories: categories without nontrivial automorphisms and inverses. We view group actions as certain functors and define the quotients as colimits of these functors. The advantage of this definition over studying the quoti...
متن کاملGroup Actions on Trees
For this paper, we will define a (non-oriented) graph Γ to be a pair Γ = (V,E), where V = vert(Γ) is a set of vertices, and E = edge(Γ) ⊆ V × V/S2 is a set of unordered pairs, known as edges between them. Two vertices, v, v′ ∈ V are considered adjacent if (v, v′) ∈ E, if there is an edge between them. An oriented graph has edge set E = edge(Γ) ⊆ V × V , ordered pairs. For an edge v = (v1, v2) i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2002
ISSN: 0166-8641
DOI: 10.1016/s0166-8641(01)00211-5